منابع مشابه
On a Combinatorial Problem in Number Theory
1. Introduction One of the problems mentioned injl] (on p. 187) concerns the estimation of the magnitude of the largest number g(N) such that, from every sequence of N distinct natural numbers, one can always select a subsequence of g{N) integers with the property that no sum of two distinct integers of this subsequence belongs to the original sequence. It should be mentioned that the function ...
متن کاملA Problem in Algebraic Number Theory
In this paper, I investigate when an algebraic number can be expressed in terms of algebraic numbers of smaller degree. First, I describe an algorithm to decide, given an irreducible polynomial P in Q[x], whether one of its roots α can be expressed as β + γ , where β and γ are roots of polynomials in Q[x] of degree strictly less than the degree of α. Then, I turn to generalizations such as when...
متن کاملAn Inverse Problem in Number Theory and Geometric Group Theory
This paper describes a new link between combinatorial number theory and geometry. The main result states that A is a finite set of relatively prime positive integers if and only if A = (K −K)∩N, where K is a compact set of real numbers such that for every x ∈ R there exists y ∈ K with x ≡ y (mod 1). In one direction, given a finite set A of relatively prime positive integers, the proof construc...
متن کاملAn Unsolvable Problem of Elementary Number Theory
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملOn a Problem in Elementary Number Theory and a Combinatorial Problem
(1) f~(n) < exp [(log n) 1 /2 ]E Recently, I observed that using a combinatorial theorem due to Rado and myself (1) can be considerably improved and it might, in fact, be possible to obtain the correct order of magnitude for f 1 (n) . The combinatorial theorem in question states as follows [2] : Let g(k, t) be the smallest integer so that if A 1 , • • • , A 8 , s = g(k, t), are sets each having...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 1971
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089500001075